Synthesis of one-dimensional linear hybrid cellular automata

Plus BROWSE SEARCH IEEE XPLORE GUIDE View TOC | Previous Article | Next Article Synthesis of one-dimensional linear hybrid cellular autom Cattell, K. Muzio, J.C. Dept. of Comput. Sci., Victoria Univ., BC; This paper appears in: Computer-Aided Design of Integrated Circuits and Systems, on Publication Date: Mar 1996 Volume: 15, Issue: 3 On page(s): 325-335 ISSN: 0278-0070 References Cited: 20 CODEN: ITCSDI INSPEC Accession Number: 5263878 Digital Object Identifier: 10.1109/43.489103 Posted online: 2002-08-06 20:22:19.0 Abstract This paper presents a method for the synthesis of a one-dimensional linear hybrid cellula from a given irreducible polynomial. A detailed description of the algorithm is given, toget the theoretical background. It is shown that two CA exist for each irreducible polynomial, open CA existence conjecture. An in-depth example of the synthesis is presented, along benchmarks and an operation count. The algorithm solves the previously open problem o all practical applicationsThis paper presents a method for the synthesis of a one-dimensional linear hybrid cellula from a given irreducible polynomial. A detailed description of the algorithm is given, toget the theoretical background. It is shown that two CA exist for each irreducible polynomial, open CA existence conjecture. An in-depth example of the synthesis is presented, along benchmarks and an operation count. The algorithm solves the previously open problem o all practical applications Index Terms Inspec Controlled Indexing cellular automata finite state machines polynomials Non-controlled Indexing CA existence conjecture irreducible polynomial linear finite state machines o dimensional linear hybrid cellular automata operation count timing benchmark Author